Multiscale Importance Metrics for Robust Skeletonization of 2D and 3D Shapes
نویسندگان
چکیده
We present a single generalized method for computing skeletons for arbitrary objects in both 2D and 3D space. We also present a method for computing the multiscale boundary-collapse importance metric for arbitrary 2D shapes in an incremental fashion, the results of which are comparable to the AFMM Star for 2D shapes. Finally, we reveal an approach which potentially allows the same importance metric to be computed for 3D shapes as well to provide results comparable to the Reniers et al.[33] method. The resulting method retains the simple implementation of the AFMM Star while avoiding the computational cost of the 3D boundary-collapse measure as computed by Reniers et al..
منابع مشابه
Tensor Network Skeletonization
We introduce a new coarse-graining algorithm, tensor network skeletonization, for the numerical computation of tensor networks. This approach utilizes a structurepreserving skeletonization procedure to remove short-range entanglements e↵ectively at every scale. This approach is first presented in the setting of 2D statistical Ising model and is then extended to higher dimensional tensor network...
متن کامل3D Skeletons: A State-of-the-Art Report
Given a shape, a skeleton is a thin centered structure which jointly describes the topology and the geometry of the shape. Skeletons provide an alternative to classical boundary or volumetric representations, which is especially effective for applications where one needs to reason about, and manipulate, the structure of a shape. These skeleton properties make them powerful tools for many types ...
متن کامل3D BENCHMARK RESULTS FOR ROBUST STRUCTURAL OPTIMIZATION UNDER UNCERTAINTY IN LOADING DIRECTIONS
This study has been inspired by the paper "An efficient 3D topology optimization code written in MATLAB” written by Liu and Tovar (2014) demonstrating that SIMP-based three-dimensional (3D) topology optimization of continuum structures can be implemented in 169 lines of MATLAB code. Based on the above paper, we show here that, by simple and easy-to-understand modificati...
متن کاملSkeletonization and segmentation of binary voxel shapes (PhD thesis)
English summary Skeletons are shape descriptors that are of a lower dimensionality than the shape they describe. They are centered within the shape, capture the shape’s symmetry, and describe the topology and articulation of the shape in a compact manner. These qualities make skeletonization a desirable pre-processing step in a variety of applications ranging from shape segmentation and retriev...
متن کاملA Comparative Study of VHDL Implementation of FT-2D-cGA and FT-3D-cGA on Different Benchmarks (RESEARCH NOTE)
This paper presents the VHDL implementation of fault tolerant cellular genetic algorithm. The goal of paper is to harden the hardware implementation of the cGA against single error upset (SEU), when affecting the fitness registers in the target hardware. The proposed approach, consists of two phases; Error monitoring and error recovery. Using innovative connectivity between processing elements ...
متن کامل